On-line fuzzy pattern matching on sequences

نویسنده

  • V. A. OLESHCHUK
چکیده

We consider pattern matching problems where patterns are presented as sequences of fuzzy constraints on input elements. Given an infinite alphabet A, a pattern P [α,β] is a sequence ­ μi1 , μi2 , ..., μim ® of membership functions μij defined on A. The pattern P fuzzy matches an input sequence t ∈ A∗ if t = ux1x2 · · ·xmv such that

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM

Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...

متن کامل

High Fuzzy Utility Based Frequent Patterns Mining Approach for Mobile Web Services Sequences

Nowadays high fuzzy utility based pattern mining is an emerging topic in data mining. It refers to discover all patterns having a high utility meeting a user-specified minimum high utility threshold. It comprises extracting patterns which are highly accessed in mobile web service sequences. Different from the traditional fuzzy approach, high fuzzy utility mining considers not only counts of mob...

متن کامل

On-line String Matching in Highly Similar DNA Sequences

We consider the problem of on-line exact string matching of a pattern in a set of highly similar sequences. This can be useful in cases where indexing the sequences is not feasible. We present a preliminary study by restricting the problem for a specific case where we adapt the classical Morris-Pratt algorithm to consider borders with errors. We give an original algorithm for computing borders ...

متن کامل

A fuzzy matching approach for design pattern mining

Mining design patterns from source code is significant for improving the intelligibility and maintainability of software. In this paper, we present a new design pattern matching method based on fuzzy, in which matrix model is used for describing both design pattern and source code, and design pattern’s static and dynamic information is defined as fuzzy attribute value for measuring the matching...

متن کامل

Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences

Now, we come to offer you the right catalogues of book to open. flexible pattern matching in strings practical on line search algorithms for texts and biological sequences is one of the literary work in this world in suitable to be reading material. That's not only this book gives reference, but also it will show you the amazing benefits of reading a book. Developing your countless minds is nee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000